Routing Algorithms for Clos Interconnection Networks

The Clos Interconnection Networks are a class of multistage switching network topologies that provide alternate path between inputs and outputs, making it possible to minimize or eliminate the blocking that can otherwise occur in such networks. In this paper, we study the various routing algorithms which have been proposed each imposing extra cost due to hardware use and re-routing algorithm and we also study a routing algorithm which takes blocking avoidance approach for avoiding related costs. There is no blocking while the primary routing is performed from the input to output. The results show that this algorithm is easy than the algorithms previously proposed. KeywordsClos Interconnection Networks, Routing Algorithms.